Main example: the subsets of a set form a Boolean algebra. To see why, let's define a set
Formally, we can define the Boolean algebra
1. Commutativity of
2. Associativity of
3. Distributivity of
4. Identity elements:
6. Complement:
7. Double complement:
This Boolean algebra formalize the usual Logic, with intersection and union in the place of "and" and "or", and the subsets being "propositions".
In the context of sets, the "implies" operator corresponds to set inclusion. That is, if
But even more, what in Logic is considered a "verifiable proposition" can be understood as open sets, endowing in this way to the set
________________________________________
________________________________________
________________________________________
Author of the notes: Antonio J. Pan-Collantes
INDEX: